The Triconnected Abstraction of Process Models
Identifieur interne : 000527 ( Main/Exploration ); précédent : 000526; suivant : 000528The Triconnected Abstraction of Process Models
Auteurs : Artem Polyvyanyy [Allemagne] ; Sergey Smirnov [Allemagne] ; Mathias Weske [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
English descriptors
- Teeft :
- Abstracted, Abstracted component, Abstracted models, Abstraction, Abstraction control mechanism, Abstraction results, Abstraction rules, Abstraction step, Algorithm, Arbitrary structure, Boundary gateway, Boundary gateways, Boundary node, Boundary nodes, Business process management, Business process model abstraction, Business process models, Component, Entry fragment, Execution order constraints, Fragment, Fragment entry, Fragment exit, Fragment skeleton, Fragment skeletons, Gateway, Heidelberg, Incoming edges, Maximal sequence, Modeling, Neighbor task, Node, Original model, Outgoing edges, Parent component, Petri, Petri nets, Polyvyanyy, Process component, Process components, Process entry, Process exit, Process fragment, Process fragments, Process graph, Process logic, Process model, Process model abstraction, Process models, Reduction rules, Same time, Separation pair, Sequential, Sequential abstraction, Simple component, Single task, Skeleton, Smirnov, Split pair, Structural relation, Triconnected, Triconnected abstraction, Triconnected abstraction technique, Triconnected components, Type abstraction, Type component, Virtual edge, Weske.
Abstract
Abstract: Companies use business process models to represent their working procedures in order to deploy services to markets, to analyze them, and to improve upon them. Competitive markets necessitate complex procedures, which lead to large process specifications with sophisticated structures. Real world process models can often incorporate hundreds of modeling constructs. While a large degree of detail complicates the comprehension of the processes, it is essential to many analysis tasks. This paper presents a technique to abstract, i.e., to simplify process models. Given a detailed model, we introduce abstraction rules which generalize process fragments in order to bring the model to a higher abstraction level. The approach is suited for the abstraction of large process specifications in order to aid model comprehension as well as decomposing problems of process model analysis. The work is based on process structure trees that have recently been introduced to the field of business process management.
Url:
DOI: 10.1007/978-3-642-03848-8_16
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000E86
- to stream Istex, to step Curation: 000E14
- to stream Istex, to step Checkpoint: 000364
- to stream Main, to step Merge: 000527
- to stream Main, to step Curation: 000527
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Triconnected Abstraction of Process Models</title><author><name sortKey="Polyvyanyy, Artem" sort="Polyvyanyy, Artem" uniqKey="Polyvyanyy A" first="Artem" last="Polyvyanyy">Artem Polyvyanyy</name></author><author><name sortKey="Smirnov, Sergey" sort="Smirnov, Sergey" uniqKey="Smirnov S" first="Sergey" last="Smirnov">Sergey Smirnov</name></author><author><name sortKey="Weske, Mathias" sort="Weske, Mathias" uniqKey="Weske M" first="Mathias" last="Weske">Mathias Weske</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:905E6E0062B86961DA36A8A1A94C28A267AB05B5</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-03848-8_16</idno><idno type="url">https://api.istex.fr/document/905E6E0062B86961DA36A8A1A94C28A267AB05B5/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000E86</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000E86</idno><idno type="wicri:Area/Istex/Curation">000E14</idno><idno type="wicri:Area/Istex/Checkpoint">000364</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000364</idno><idno type="wicri:doubleKey">0302-9743:2009:Polyvyanyy A:the:triconnected:abstraction</idno><idno type="wicri:Area/Main/Merge">000527</idno><idno type="wicri:Area/Main/Curation">000527</idno><idno type="wicri:Area/Main/Exploration">000527</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Triconnected Abstraction of Process Models</title><author><name sortKey="Polyvyanyy, Artem" sort="Polyvyanyy, Artem" uniqKey="Polyvyanyy A" first="Artem" last="Polyvyanyy">Artem Polyvyanyy</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Business Process Technology Group, Hasso Plattner Institute at the University of Potsdam, Prof.-Dr.-Helmert-Str. 2-3, D-14482, Potsdam</wicri:regionArea><placeName><region type="land" nuts="2">Brandebourg</region><settlement type="city">Potsdam</settlement></placeName><orgName type="university">Université de Potsdam</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Smirnov, Sergey" sort="Smirnov, Sergey" uniqKey="Smirnov S" first="Sergey" last="Smirnov">Sergey Smirnov</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Business Process Technology Group, Hasso Plattner Institute at the University of Potsdam, Prof.-Dr.-Helmert-Str. 2-3, D-14482, Potsdam</wicri:regionArea><placeName><region type="land" nuts="2">Brandebourg</region><settlement type="city">Potsdam</settlement></placeName><orgName type="university">Université de Potsdam</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Weske, Mathias" sort="Weske, Mathias" uniqKey="Weske M" first="Mathias" last="Weske">Mathias Weske</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Business Process Technology Group, Hasso Plattner Institute at the University of Potsdam, Prof.-Dr.-Helmert-Str. 2-3, D-14482, Potsdam</wicri:regionArea><placeName><region type="land" nuts="2">Brandebourg</region><settlement type="city">Potsdam</settlement></placeName><orgName type="university">Université de Potsdam</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Abstracted</term><term>Abstracted component</term><term>Abstracted models</term><term>Abstraction</term><term>Abstraction control mechanism</term><term>Abstraction results</term><term>Abstraction rules</term><term>Abstraction step</term><term>Algorithm</term><term>Arbitrary structure</term><term>Boundary gateway</term><term>Boundary gateways</term><term>Boundary node</term><term>Boundary nodes</term><term>Business process management</term><term>Business process model abstraction</term><term>Business process models</term><term>Component</term><term>Entry fragment</term><term>Execution order constraints</term><term>Fragment</term><term>Fragment entry</term><term>Fragment exit</term><term>Fragment skeleton</term><term>Fragment skeletons</term><term>Gateway</term><term>Heidelberg</term><term>Incoming edges</term><term>Maximal sequence</term><term>Modeling</term><term>Neighbor task</term><term>Node</term><term>Original model</term><term>Outgoing edges</term><term>Parent component</term><term>Petri</term><term>Petri nets</term><term>Polyvyanyy</term><term>Process component</term><term>Process components</term><term>Process entry</term><term>Process exit</term><term>Process fragment</term><term>Process fragments</term><term>Process graph</term><term>Process logic</term><term>Process model</term><term>Process model abstraction</term><term>Process models</term><term>Reduction rules</term><term>Same time</term><term>Separation pair</term><term>Sequential</term><term>Sequential abstraction</term><term>Simple component</term><term>Single task</term><term>Skeleton</term><term>Smirnov</term><term>Split pair</term><term>Structural relation</term><term>Triconnected</term><term>Triconnected abstraction</term><term>Triconnected abstraction technique</term><term>Triconnected components</term><term>Type abstraction</term><term>Type component</term><term>Virtual edge</term><term>Weske</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Companies use business process models to represent their working procedures in order to deploy services to markets, to analyze them, and to improve upon them. Competitive markets necessitate complex procedures, which lead to large process specifications with sophisticated structures. Real world process models can often incorporate hundreds of modeling constructs. While a large degree of detail complicates the comprehension of the processes, it is essential to many analysis tasks. This paper presents a technique to abstract, i.e., to simplify process models. Given a detailed model, we introduce abstraction rules which generalize process fragments in order to bring the model to a higher abstraction level. The approach is suited for the abstraction of large process specifications in order to aid model comprehension as well as decomposing problems of process model analysis. The work is based on process structure trees that have recently been introduced to the field of business process management.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Brandebourg</li></region><settlement><li>Potsdam</li></settlement><orgName><li>Université de Potsdam</li></orgName></list><tree><country name="Allemagne"><region name="Brandebourg"><name sortKey="Polyvyanyy, Artem" sort="Polyvyanyy, Artem" uniqKey="Polyvyanyy A" first="Artem" last="Polyvyanyy">Artem Polyvyanyy</name></region><name sortKey="Polyvyanyy, Artem" sort="Polyvyanyy, Artem" uniqKey="Polyvyanyy A" first="Artem" last="Polyvyanyy">Artem Polyvyanyy</name><name sortKey="Smirnov, Sergey" sort="Smirnov, Sergey" uniqKey="Smirnov S" first="Sergey" last="Smirnov">Sergey Smirnov</name><name sortKey="Smirnov, Sergey" sort="Smirnov, Sergey" uniqKey="Smirnov S" first="Sergey" last="Smirnov">Sergey Smirnov</name><name sortKey="Weske, Mathias" sort="Weske, Mathias" uniqKey="Weske M" first="Mathias" last="Weske">Mathias Weske</name><name sortKey="Weske, Mathias" sort="Weske, Mathias" uniqKey="Weske M" first="Mathias" last="Weske">Mathias Weske</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000527 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000527 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:905E6E0062B86961DA36A8A1A94C28A267AB05B5
|texte= The Triconnected Abstraction of Process Models
}}
| This area was generated with Dilib version V0.6.33. |  |